Solving the Transportation Problem Using a Multi-Attribute Model
نویسندگان
چکیده
The transportation hassle, in operations research, is perhaps one of the issues that studied more. There exists a plenty number fashions to resolve hassle simply product, which does not take place now like identical case multiples products. had been where assimilating multiple product single product. research has focused proper exposition trouble couple transport, and simplest cautioned some techniques solution, for unique cases, they permit few simplifications, Located this example, goal investigation provide model strategy it isn't limited but with intention be successful clear up problem thinking about different factors uses multi-attribute technique.
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولUsing necessarily weak efficient solutions for solving a biobjective transportation problem with fuzzy objective functions coefficients
This paper considers a biobjective transportation problem with various fuzzy objective functions coefficients. Fuzzy coefficients can be of different types such as triangular, trapezoidal, (semi) $L-R$, or flat (semi) $L-R$ fuzzy numbers. First, we convert the problem to a parametric interval biobjective transportation problem using $gamma$-cuts of fuzzy coefficients. Then, we consider a fix $g...
متن کاملSolving the Fixed Charge Transportation Problem by New Heuristic Approach
The fixed charge transportation problem (FCTP) is a deployment of the classical transportation problem in which a fixed cost is incurred, independent of the amount transported, along with a variable cost that is proportional to the amount shipped. Since the problem is considered as an NP-hard, the computational time grows exponentially as the size of the problem increases. In this pape...
متن کاملOptimally Solving a Transportation Problem Using Voronoi Diagrams
We consider the following variant of the well-known Monge-Kantorovich transportation problem. Let S be a set of n point sites in R. A bounded set C ⊂ R is to be distributed among the sites p ∈ S such that (i), each p receives a subset Cp of prescribed volume and (ii), the average distance of all points z of C from their respective sites p is minimized. In our model, volume is quantified by a me...
متن کاملSolving a bi-objective project capital budgeting problem using a fuzzy multi-dimensional knapsack
In this paper, the researchers have proposed a multi-dimensional knapsack model for project capital budgeting problem in uncertain situation which has been modeled through fuzzy sets. The optimistic and pessimistic situations were considered and associated deterministic models were yielded. Numerical example has been supplied toillustrate the performance of proposed model. The results were prom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: General letters in mathematics
سال: 2022
ISSN: ['2519-9269', '2519-9277']
DOI: https://doi.org/10.31559/glm2022.12.3.4